Fixed-Point Optimal Smoothing Problems for a Liner Distributed Parameter System
نویسندگان
چکیده
منابع مشابه
A strong convergence theorem for solutions of zero point problems and fixed point problems
Zero point problems of the sum of two monotone mappings and fixed point problems of a strictly pseudocontractive mapping are investigated. A strong convergence theorem for the common solutions of the problems is established in the framework of Hilbert spaces.
متن کاملa strong convergence theorem for solutions of zero point problems and fixed point problems
zero point problems of the sum of two monotone mappings and fixed point problems of a strictly pseudocontractive mapping are investigated. a strong convergence theorem for the common solutions of the problems is established in the framework of hilbert spaces.
متن کاملOptimal Fixed-Order Compensation of Distributed Parameter Systems
r. Gary Rosen * * Department of Mathematics University of Southern California Los Angeles, CA 90089 In controlling distributed parameter systems it is often desirable to obtain low-order, finitedimensional controllers in order to minimize real-time computational requirements. Standard approaches to this problem employ model/controller reduction techniques in conjunction with LQG theory. In this...
متن کاملEquilibrium problems and fixed point problems for nonspreading-type mappings in hilbert space
In this paper by using the idea of mean convergence, weintroduce an iterative scheme for finding a common element of theset of solutions of an equilibrium problem and the fixed points setof a nonspreading-type mappings in Hilbert space. A strongconvergence theorem of the proposed iterative scheme is establishedunder some control conditions. The main result of this paper extendthe results obtain...
متن کاملFixed parameter algorithms for restricted coloring problems
In this paper, we obtain polynomial time algorithms to determine the acyclic chromatic number, the star chromatic number, the Thue chromatic number, the harmonious chromatic number and the clique chromatic number of P4-tidy graphs and (q, q−4)-graphs, for every fixed q. These classes include cographs, P4-sparse and P4-lite graphs. All these coloring problems are known to be NP-hard for general ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 1975
ISSN: 0453-4654
DOI: 10.9746/sicetr1965.11.682